منابع مشابه
On Stateless Automata and P Systems
We introduce the notion of stateless multihead two-way (respectively, oneway) NFAs and stateless multicounter systems and relate them to P systems and vector addition systems. In particular, we investigate the decidability of the emptiness and reachability problems for these stateless automata and show that the results are applicable to similar questions concerning certain variants of P systems...
متن کاملOn Stateless Multihead Finite Automata and Multihead Pushdown Automata
A stateless k-head two-way deterministic finite automaton (k-head 2DFA), has only one state, hence the designation stateless. Its transitions depends solely on the symbols currently scanned by its k heads, and in every such transition each head can move one cell left, right, or remain stationary. An input, which is delimited by end markers, is accepted if the machine, when started with all head...
متن کاملHierarchical Automata and P-systems
In the context of a compositional theory of automata [8] (CP automata) we define a notion of hierarchical automaton, and show how the P-systems of Gh. Păun [9] may be described in terms of these automata. A distributive law for CP automata is proved which relates two different views of hierarchical systems: the first view is that hierarchical systems consist of layers, with communication betwee...
متن کاملSystolic Automata and P Systems
Systolic automata are models of highly-concurrent language acceptors based on identical processors with one-way flow of information, amenable to efficient hardware implementation as multiprocessor chips. In this paper we investigate the relationship between Binary Systolic TreeAutomata (BSTA), inwhich the underlying communication structure is an infinite complete binary tree with parallel botto...
متن کاملOn Some Decision Problems for Stateless Deterministic Ordered Restarting Automata
The stateless deterministic ordered restarting automata accept exactly the regular languages, and it is known that the trade-off for turning a stateless deterministic ordered restarting automaton into an equivalent DFA is at least double exponential. Here we present a construction that yields an equivalent NFA of size 2 from a stateless deterministic ordered restarting automaton that works on a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Foundations of Computer Science
سال: 2008
ISSN: 0129-0541,1793-6373
DOI: 10.1142/s0129054108006261